Search for: All records

Random Fourier Features (RFF) is among the most popular and broadly applicable approaches for scaling up kernel methods. In essence, RFF allows the user to avoid costly computations with a large kernel matrix via a fast randomized approximation. However, a pervasive difficulty in applying RFF is that the user does not know the actual error of the approximation, or how this error will propagate into downstream learning tasks. Up to now, the RFF literature has primarily dealt with these uncertainties using theoretical error bounds, but from a user’s standpoint, such results are typically impractical—either because they are highly conservative or involve unknown quantities. To tackle these general issues in a data-driven way, this paper develops a bootstrap approach to numerically estimate the errors of RFF approximations. Three key advantages of this approach are: (1) The error estimates are specific to the problem at hand, avoiding the pessimism of worst-case bounds. (2) The approach is flexible with respect to different uses of RFF, and can even estimate errors in downstream learning tasks. (3) The approach enables adaptive computation, in the sense that the user can quickly inspect the error of a rough initial kernel approximation and then predict how much extra work is needed. Furthermore, in exchange for all of these benefits, the error estimates can be obtained at a modest computational cost. 

In the Hidden-Parameter MDP (HiP-MDP) framework, a family of reinforcement learning tasks is generated by varying hidden parameters specifying the dynamics and reward function for each individual task. The HiP-MDP is a natural model for families of tasks in which meta- and lifelong-reinforcement learning approaches can succeed. Given a learned context encoder that infers the hidden parameters from previous experience, most existing algorithms fall into two categories: model transfer and policy transfer, depending on which function the hidden parameters are used to parameterize. We characterize the robustness of model and policy transfer algorithms with respect to hidden parameter estimation error. We first show that the value function of HiP-MDPs is Lipschitz continuous under certain conditions. We then derive regret bounds for both settings through the lens of Lipschitz continuity. Finally, we empirically corroborate our theoretical analysis by varying the hyper-parameters governing the Lipschitz constants of two continuous control problems; the resulting performance is consistent with our theoretical results. 

Abstract The dispersive sweep of fast radio bursts (FRBs) has been used to probe the ionized baryon content of the intergalactic medium 1 , which is assumed to dominate the total extragalactic dispersion. Although the host-galaxy contributions to the dispersion measure appear to be small for most FRBs 2 , in at least one case there is evidence for an extreme magneto-ionic local environment 3,4 and a compact persistent radio source 5 . Here we report the detection and localization of the repeating FRB 20190520B, which is co-located with a compact, persistent radio source and associated with a dwarf host galaxy of high specific-star-formation rate at a redshift of 0.241 ± 0.001. The estimated host-galaxy dispersion measure of approximately $${903}_{-111}^{+72}$$ 903 − 111 + 72 parsecs per cubic centimetre, which is nearly an order of magnitude higher than the average of FRB host galaxies 2,6 , far exceeds the dispersion-measure contribution of the intergalactic medium. Caution is thus warranted in inferring redshifts for FRBs without accurate host-galaxy identifications.